A Partitioning Algorithm for Maximum Common Subgraph Problems
نویسندگان
چکیده
We introduce a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning. Our method in some ways resembles a traditional constraint programming approach, but uses a novel compact domain store and supporting inference algorithms which dramatically reduce the memory and computation requirements during search, and allow better dual viewpoint ordering heuristics to be calculated cheaply. Experiments show a speedup of more than an order of magnitude over the state of the art, and demonstrate that we can operate on much larger graphs without running out of memory.
منابع مشابه
Approximations via Partitioning
We consider the approximation of weighted maximum subgraph problems by partitioning the input graph into easier subproblems. In particular, we obtain efficient approximations of the weighted independent set problem with performance ratios of O(n(log log n/ log n)) and (∆ + 2)/3, with the latter improving on a ∆/2 ratio of Hochbaum for ∆ ≥ 5. We also obtain a O(n/ log n) performance ratio for va...
متن کاملFast Partitioning l-apex graphs with Applications to Approximating Maximum Induced-Subgraph Problems
A graph is l-apex if it can be made planar by removing at most l vertices. In this paper we show that the vertex set of any graph not containing an l-apex graph as a minor can be quickly partitioned into 2 l sets inducing graphs with small treewidth. As a consequence, several maximum induced-subgraph problems when restricted to graph classes not containing some special l-apex graphs as minors, ...
متن کاملOn the Approximability of the Maximum Common Subgraph Problem
Some versions of the maximum common subgraph problem are studied and approximation algorithms are given. The maximum bounded common induced subgraph problem is shown to be Max SNP-hard and the maximum unbounded common induced subgraph problem is shown to be as hard to approximate as the maximum independent set problem. The maximum common induced connected subgraph problem is still harder to app...
متن کاملSolving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops
A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...
متن کاملWeak Recovery Conditions from Graph Partitioning Bounds and Order Statistics
We study a weaker formulation of the nullspace property which guarantees recovery of sparse signals from linear measurements by `1 minimization. We require this condition to hold only with high probability, given a distribution on the nullspace of the coding matrix A. Under some assumptions on the distribution of the reconstruction error, we show that testing these weak conditions means boundin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017